Parallel Algorithms on Strings
نویسنده
چکیده
Wojciech Rytter Warsaw University 30.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملPerfect Hashing for Strings: Formalization and Algorithms
Numbers and strings are two objects manipulated by most programs. Hashing has been well-studied for numbers and it has been eeective in practice. In contrast, basic hashing issues for strings remain largely unex-plored. In this paper, we identify and formulate the core hashing problem for strings that we call substring hashing. Our main technical results are highly eecient sequential/parallel (...
متن کاملOptimization of concrete structure mixture plan in marine environment using genetic algorithm
Today due to increasing development and importance of petroleum activities andmarine transport as well as due to the mining of seabed, building activities such as construction of docks, platforms and structures as those in coastal areas and oceans has increased significantly. Concrete strength as one of the most important necessary parameters for designing, depends on many factors such as mixtu...
متن کاملMassively Parallel Genetic Algorithms
Heuristic algorithms are usually employed to find an optimal solution to NP-Complete problems. Genetic algorithms are among such algorithms and they are search algorithms based on the mechanics of natural selection and genetics. Since genetic algorithms work with a set of candidate solutions, parallelisation based on the SIMD paradigm seems to be the natural way to obtain a speed up. In this ap...
متن کاملSequential and Parallel Algorithms for the Shortest Common Superstring Problem
We design sequential and parallel genetic algorithms, simulated annealing algorithms and improved greedy algorithms for the shortest common superstring problem(SCS), which is to find the shortest string that contains all strings from a given set of strings. The SCS problem is NP-complete [7]. It is even MAX SNP hard [2] i.e. no polynomial-time algorithm exists, that can approximate the optimum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007